Least Change Secant Update Methods for Nonlinear Complementarity Problem
نویسندگان
چکیده
منابع مشابه
A new gradient method via least change secant update
The Barzilai–Borwein (BB) gradient method is favourable over the classical steepest descent method both in theory and in real computations. This method takes a 'fixed' step size rather than following a set of line search rules to ensure convergence. Along this line, we present a new approach for the two-point approximation to the quasi-Newton equation within the BB framework on the basis of a w...
متن کاملOn the Relation between Two Local Convergence Theories of Least-change Secant Update Methods
In this paper, we show that the main results of the local convergence theory for least-change secant update methods of Dennis and Walker (SIAM J. Numer. Anal. 18 (1981), 949-987) can be proved using the theory introduced recently by Martinez (Math. Comp. 55 (1990), 143-167). In addition, we exhibit two generalizations of well-known methods whose local convergence can be easily proved using Mart...
متن کاملOptimization Based Globally Convergent Methods for the Nonlinear Complementarity Problem
The nonlinear complementarity problem has been used to study and formulate various equilibrium problems including the traffic equilibrium problem, the spatial equilibrium problem and the Nash equilibrium problem. To solve the nonlinear complementarity problem, various iterative methods such as projection methods, linearized methods and Newton method have been proposed and their convergence resu...
متن کاملA secant method for nonlinear least-squares minimization
Quasi-Newton methods have played a prominent role, over many years, in the design of effective practical methods for the numerical solution of nonlinear minimization problems and in multi-dimensional zero-finding. There is a wide literature outlining the properties of these methods and illustrating their performance [e.g., [8]]. In addition, most modern optimization libraries house a quasi-Newt...
متن کاملSuper linear Projected Structured Exact Penalty Secant Methods for Constrained Nonlinear Least Squares
We present an exact penalty approach for solving constrained nonlinear least squares problems, using a new projected structured Hessian approximation scheme. We establish general conditions for the local two-step Q-superlinear convergence of our given algorithm. The approach is general enough to include the projected version of the structured PSB, DFP and BFGS formulas as special cases. The num...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ingeniería y Ciencia
سال: 2015
ISSN: 1794-9165,2256-4314
DOI: 10.17230/ingciencia.11.21.1